AC Unification Through Order-Sorted AC1 Unification
نویسندگان
چکیده
منابع مشابه
Order-sorted Equational Unification Revisited
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of int...
متن کاملOrder-Sorted Feature Theory Unification
Order-sorted feature (OSF) terms provide an adequate representation for objects as flexible records. They are sorted, attributed, possibly nested, structures, ordered thanks to a subsort ordering. Sort definitions offer the functionality of classes imposing structural constraints on objects. These constraints involve variable sorting and equations among feature paths, including self-reference. ...
متن کاملOrder-Sorted Unification with Regular Expression Sorts
We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is finite. The corresponding unification problem is infinitary. We conjecture that this unification problem is decidable and give a complete unification procedure.
متن کاملRegular expression order-sorted unification and matching
We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and decidable. The unification problem presented by us generalizes some known problems, such as, e.g...
متن کاملAC-Unification of Higher-Order Patterns
We present a complete algorithm for the uniication of higher-order patterns modulo the associative-commutative theory of some constants +1; : : : ; +n. Given an AC-uniication problem over higher-order patterns, the output of the algorithm is a nite set DAG solved forms 9], constrained by some exible-exible equations with the same head on both sides. Indeed, in the presence of AC constants, such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1992
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(19)80001-9